منابع مشابه
On the non-unit count of interval graphs
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interval representation whose lengths deviate from one. We characterize a variant of the non-unit count (where all interval lengths are required to be at least one) and graphs with non-unit count 1.
متن کاملUnit Mixed Interval Graphs
In this paper we extend the work of Rautenbach and Szwarcfiter [8] by giving a structural characterization of graphs that can be represented by the intersection of unit intervals that may or may not contain their endpoints. A characterization was proved independently by Joos in [6], however our approach provides an algorithm that produces such a representation, as well as a forbidden graph char...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولPrecoloring extension on unit interval graphs
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [6], we show that the precoloring extension problem is NP-complete on unit interval graphs.
متن کاملMulti-Armed Bandits on Unit Interval Graphs
An online learning problem with side information on the similarity and dissimilarity across different actions is considered. The problem is formulated as a stochastic multiarmed bandit problem with a graph-structured learning space. Each node in the graph represents an arm in the bandit problem and an edge between two nodes represents closeness in their mean rewards. It is shown that the result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.11.004